Finding Optimal 1-Endpoint-Crossing Trees
نویسندگان
چکیده
منابع مشابه
Finding Optimal 1-Endpoint-Crossing Trees
Dependency parsing algorithms capable of producing the types of crossing dependencies seen in natural language sentences have traditionally been orders of magnitude slower than algorithms for projective trees. For 95.899.8% of dependency parses in various natural language treebanks, whenever an edge is crossed, the edges that cross it all have a common vertex. The optimal dependency tree that s...
متن کاملParsing to 1-Endpoint-Crossing, Pagenumber-2 Graphs
We study the Maximum Subgraph problem in deep dependency parsing. We consider two restrictions to deep dependency graphs: (a) 1-endpoint-crossing and (b) pagenumber-2. Our main contribution is an exact algorithm that obtains maximum subgraphs satisfying both restrictions simultaneously in time O(n5). Moreover, ignoring one linguistically-rare structure descreases the complexity to O(n4). We als...
متن کاملExploiting Structure in Parsing to 1-Endpoint-Crossing Graphs
Deep dependency parsing can be cast as the search for maximum acyclic subgraphs in weighted digraphs. Because this search problem is intractable in the general case, we consider its restriction to the class of 1endpoint-crossing (1ec) graphs, which has high coverage on standard data sets. Our main contribution is a characterization of 1ec graphs as a subclass of the graphs with pagenumber at mo...
متن کاملFinding Trees from Unordered 0-1 Data
Tree structures are a natural way of describing occurrence relationships between attributes in a dataset. We define a new class of tree patterns for unordered 0–1 data and consider the problem of discovering frequently occurring members of this pattern class. Intuitively, a tree T occurs in a row u of the data, if the attributes of T that occur in u form a subtree of T containing the root. We s...
متن کاملFinding optimal satisficing strategies for and-or trees
Many tasks require evaluating a specified Boolean expression over a set of probabilistic tests whose costs and success probabilities are each known. A strategy specifies when to perform which test, towards determining the overall outcome of . We are interested in finding the strategy with the minimum expected cost. As this task is typically NP-hard — for example, when tests can occur many times...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2013
ISSN: 2307-387X
DOI: 10.1162/tacl_a_00206